Tutte polynomial and G-parking functions
نویسندگان
چکیده
Let G be a connected graph with vertex set {0, 1, 2, . . . , n}. We allow G to have multiple edges and loops. In this paper, we give a characterization of external activity by some parameters of G-parking functions. In particular, we give the definition of the bridge vertex of a G-parking function and obtain an expression of the Tutte polynomial TG(x, y) of G in terms of G-parking functions. We find the Tutte polynomial enumerates the G-parking function by the number of the bridge vertices.
منابع مشابه
Multiparking Functions, Graph Searching, and the Tutte Polynomial
A parking function of length n is a sequence (b1, b2, . . . , bn) of nonnegative integers for which there is a permutation π ∈ Sn so that 0 ≤ bπ(i) < i for all i. A well-known result about parking functions is that the polynomial Pn(q), which enumerates the complements of parking functions by the sum of their terms, is the generating function for the number of connected graphs by the number of ...
متن کاملGeneralizing the Inversion Enumerator to G-Parking Functions
We consider a generalization of the inversion enumerator for G-parking functions, IG(q). We find several recurrences for IG(−1), including a recursive formula whenever G is the cone over a tree. We relate IG(−1) to the number of partial orientations of G. Using the connection between IG and the Tutte Polynomial, we find another recursive formula for IG(−1). For any partial cone G over a tree T ...
متن کاملTutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملThe Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
One of the most important numerical quantities that can be computed from a graph G is the two-variable Tutte polynomial. Specializations of the Tutte polynomial count various objects associated with G, e.g., subgraphs, spanning trees, acyclic orientations, inversions and parking functions. We show that by partitioning certain simplicial complexes related to G into intervals, one can provide com...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کامل